A Comparison of Parallel Programming Models of Network Processors
نویسندگان
چکیده
Today’s network processor utilize parallel processing in order to cope with the traffic growth and wire-speed of current and future network technologies. In this paper, we study two important parallel programming models for network processors: run to completion and pipelining. In particular, the packet flow of a standard network application, IPv4 Forwarding, through two examined network processors, IBM PowerNP NP4GS3 and Intel IXP1200, is reviewed and characterized in respect to their programming models. Based on a benchmark for PC-cluster SANs, their application throughput and latency for Gigabit Ethernet is investigated and compared to a commercial, ASIC-based switch. It is shown that in this scenario network processors can compete with hard-wired solutions.
منابع مشابه
CREDIBILITY-BASED FUZZY PROGRAMMING MODELS TO SOLVE THE BUDGET-CONSTRAINED FLEXIBLE FLOW LINE PROBLEM
This paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...
متن کاملA Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کاملEFFICIENCY MEASUREMENT OF NDEA WITH INTERVAL DATA
Data envelopment analysis (DEA) is a non-parametric technique for evaluation of relative efficiency of decision making units described by multiple inputs and outputs. It is based on solving linear programming problems. Since 1978 when basic DEA model was introduced many its modifications were formulated. Among them are two or multi-stage models with serial or parallel structure often called net...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملRelative Efficiency Measurement of Banks Using Network DEA Model in Uncertainty Situation
Traditional DEA method considered decision making units (DMUs) as a black box, regardless of their internal structure and appraisal performance with respect to the final inputs and outputs of the units. However, in many real systems we have internal structure. For this reason, network DEA models have been developed. Parallel network DEA models are a special variation which inputs of unit alloca...
متن کامل